A QUBO Model for the Traveling Salesman Problem with Time Windows
نویسندگان
چکیده
منابع مشابه
The A Priori Dynamic Traveling Salesman Problem with Time Windows
The remarkable advances in telecommunications and information technology have enabled companies to focus on velocity and timeliness throughout the supply chain. To achieve these competitive advantages, they must be able to make effective use of the vast amount of real-time information now available to them. The Dynamic Vehicle Routing Problem (DVRP) is a prime example of a distribution context ...
متن کاملTime-Dependent Traveling Salesman Problem with Multiple Time Windows
The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows. Moreover, since the assumption of constant travel time between two locatio...
متن کاملAn integer programming approach for the time-dependent traveling salesman problem with time windows
Congestion in large cities and populated areas is one of the major challenges in urban logistics, and should be addressed at different planning and operational levels. The Time Dependent Travelling Salesman Problem (TDTSP) is a generalization of the well known Traveling Salesman Problem (TSP) where the travel times are not assumed to be constant along the day. The motivation to consider the tim...
متن کاملA Bi-directional Resource-bounded Dynamic Programming Approach for the Traveling Salesman Problem with Time Windows
This paper presents a bi-directional resource-bounded label correcting algorithm for the traveling salesman problem with time windows, in which the objective is to minimize travel times. Label extensions and dominance start simultaneously in both forward and backward directions: the forward direction from the starting depot and the backward direction from the terminating depot. The resultant la...
متن کاملA Computational Study of Bi-directional Dynamic Programming for the Traveling Salesman Problem with Time Windows
This paper presents computational studies for the traveling salesman problem with time windows by applying a bi-directional resource-bounded label correcting algorithm. Label extensions and dominance start simultaneously in both forward and backward directions: the forward direction from the starting depot and the backward direction from the terminating depot. The resultant label extension proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2019
ISSN: 1999-4893
DOI: 10.3390/a12110224